Defeasible Reasoning with Quantifiers

نویسندگان

  • Lupita Estefania Gazzo Castaneda
  • Markus Knauff
چکیده

Human conditional reasoning is defeasible: people withdraw logically valid conclusions if they are aware of situations (i.e., exceptions) that prevent the consequent of the rule to happen although the antecedent is given. In this paper we investigate defeasible reasoning with quantified rules. In two experiments we rephrased conditionals from the literature (Experiment 1) and rules from penal code (Experiment 2) as either universal or existential rules and embedded them into Modus Ponens and Modus Tollens inference problems. We show that defeasible reasoning also exists for quantified rules. However, the kind of quantifier (universal vs. existential) did not affect inferences. This last finding conflicts with theories highlighting the importance of logic in human reasoning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analogy, Decision, And Theory-Formation As Defeasible Reasoning

The development of computationally informed formalisms for reasoning with defeasible rules affords new accounts of familiar forms of reasoning. This paper points to recent accounts of defeasible reasoning and portrays analogy, decision, and theory-formation as essentially defeasible, in the same way that statistical reasoning has been portrayed. Each portrayal depends largely on the idea of par...

متن کامل

An Approach for Argumentation-based Reasoning Using Defeasible Logic in Multi-Agent Programming Languages

Argumentation systems are intimately related to nonmonotonic reasoning, of which defeasible reasoning is one widely-known approach. For example, the literature points out defeasible logic (a particular formalisation of defeasible reasoning) as a practical platform upon which to develop an argumentation system. In this paper, we develop an approach to endow AgentSpeak agents with argumentative c...

متن کامل

ar X iv : c s . L O / 0 20 70 86 v 1 2 5 Ju l 2 00 2 A Model - Theoretic Semantics for Defeasible Logic ⋆

Defeasible logic is an efficient logic for defeasible reasoning. It is defined through a proof theory and, until now, has had no model theory. In this paper a model-theoretic semantics is given for defeasible logic. The logic is sound and complete with respect to the semantics. We also briefly outline how this approach extends to a wide range of defeasible logics.

متن کامل

FIPA Dialogues in Defeasible Logic

In this paper we formalize reasoning about agent dialogue semantics in defeasible logic, including FIPA speech acts. We introduce a defeasible logic for efficient reasoning about agents, roles, mental attitudes, time and communication. We introduce the inform and request action of FIPA in the logic by attributing the mental attitudes to roles, we extend it with defeasible reasoning about the me...

متن کامل

Making Quantification Relevant Again - the Case of Defeasible EL_\bot

Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015